Topological Parameters for time-space tradeo
نویسنده
چکیده
In this paper we propose a family of algorithms combining tree-clustering with conditioning that trade space for time. Such algorithms are useful for reasoning in probabilistic and deterministic networks as well as for accomplishing optimization tasks. By analyzing the problem structure it will be possible to select from a spectrum the algorithm that best meets a given time-space speci cation.
منابع مشابه
TOPOLOGICAL CHARACTERIZATION FOR FUZZY REGULAR LANGUAGES
We present a topological characterization for fuzzy regular languages: we show that there is a bijective correspondence between fuzzy regular languages and the set of all clopen fuzzy subsets with finite image in the induced fuzzy topological space of Stone space (Profinite space), and then we give a representation of closed fuzzy subsets in the induced fuzzy topological space via fuzzy regular...
متن کاملFuzzy particle swarm optimization with nearest-better neighborhood for multimodal optimization
In the last decades, many efforts have been made to solve multimodal optimization problems using Particle Swarm Optimization (PSO). To produce good results, these PSO algorithms need to specify some niching parameters to define the local neighborhood. In this paper, our motivation is to propose the novel neighborhood structures that remove undesirable niching parameters without sacrificing perf...
متن کاملSome results of semilocally simply connected property
If we consider some special conditions, we can assume fundamental group of a topological space as a new topological space. In this paper, we will present a number of theorems in topological fundamental group related to semilocally simply connected property for a topological space.
متن کاملTime-Space Tradeo s for Undirected Graph Traversal by Graph Automata
We investigate time-space tradeo s for traversing undirected graphs, using a variety of structured models that are all variants of Cook and Racko 's \Jumping Automata for Graphs". Our strongest tradeo is a quadratic lower bound on the product of time and space for graph traversal. For example, achieving linear time requires linear space, implying that depthrst search is optimal. Since our bound...
متن کاملdominating subset and representation graph on topological spaces
Let a topological space. An intersection graph on a topological space , which denoted by , is an undirected graph which whose vertices are open subsets of and two vertices are adjacent if the intersection of them are nonempty. In this paper, the relation between topological properties of and graph properties of are investigated. Also some classifications and representations for the graph ...
متن کامل